Excluded permutation matrices and the Stanley-Wilf conjecture
نویسندگان
چکیده
This paper examines the extremal problem of how many 1-entries an n × n 0–1 matrix can have that avoids a certain fixed submatrix P . For any permutation matrix P we prove a linear bound, settling a conjecture of Zoltán Füredi and Péter Hajnal [8]. Due to the work of Martin Klazar [12], this also settles the conjecture of Stanley and Wilf on the number of n-permutations avoiding a fixed permutation and a related conjecture of Alon and Friedgut [1].
منابع مشابه
On the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
We show that the Stanley–Wilf limit for the class of 4231-avoiding permutations is at least by 9.47. This bound shows that this class has the largest such limit among all classes of permutations avoiding a single permutation of length 4 and refutes the conjecture that the Stanley–Wilf limit of a class of permutations avoiding a single permutation of length k cannot exceed (k−1)2. The result is ...
متن کاملF Uredi{hajnal Conjecture Implies Stanley{wilf Conjecture Two Nite Sequences U = a 1 a 2 : : : a K 2 N
We show that Stanley{Wilf enumerative conjecture on permutations follows easily from F uredi{Hajnal extremal conjecture on 0-1 matrices. We apply the method of deriving an (almost) exponential bound on number of objects from a (almost) linear bound on their sizes, which was discovered by Alon and Friedgut. They proved by it a weaker form of Stanley{Wilf conjecture. Using bipartite graphs, we gi...
متن کاملStanley-Wilf limits are typically exponential
For a permutation π, let Sn(π) be the number of permutations on n letters avoiding π. Marcus and Tardos proved the celebrated Stanley-Wilf conjecture that L(π) = limn→∞ Sn(π) 1/n exists and is finite. Backed by numerical evidence, it has been conjectured by many researchers over the years that L(π) = Θ(k) for every permutation π on k letters. We disprove this conjecture, showing that L(π) = 2 Θ...
متن کاملBetter upper bounds on the Füredi-Hajnal limits of permutations
A binary matrix is a matrix with entries from the set {0, 1}. We say that a binary matrix A contains a binary matrix S if S can be obtained from A by removal of some rows, some columns, and changing some 1-entries to 0-entries. If A does not contain S, we say that A avoids S. A k-permutation matrix P is a binary k× k matrix with exactly one 1-entry in every row and one 1-entry in every column. ...
متن کاملOn the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia
We construct a sequence of finite automata that accept subclasses of the class of 4231-avoiding permutations. We thereby show that the WilfStanley limit for the class of 4231-avoiding permutations is bounded below by 9.35. This bound shows that this class has the largest such limit among all classes of permutations avoiding a single permutation of length 4 and refutes the conjecture that the Wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 107 شماره
صفحات -
تاریخ انتشار 2004